37A - Towers - CodeForces Solution

sortings *1000

Please click on ads to support us..

Python Code: 

n=int(input())
l=[int(x) for x in input().split()]
d={}
for i in range(n):
    d[i]=l.count(l[i])
print(max(d.values()),len(set(l)))

C++ Code: 

#include <bits/stdc++.h>
using namespace std ;
const int AKA =5e5+5;
int fr[AKA];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;++i)
    {
        int value;
        scanf("%d",&value);
        ++fr[value];
    }
    int sum=0 , mx=1;
    for(int i=0;i<=1000;++i){
        if(fr[i])
        ++sum;
     if(fr[i]>mx)
            mx=fr[i];
    }
    printf("%d %d",mx,sum);
}


Comments

Submit
0 Comments
More Questions

1515E - Phoenix and Computers
1552B - Running for Gold
994A - Fingerprints
1221C - Perfect Team
1709C - Recover an RBS
378A - Playing with Dice
248B - Chilly Willy
1709B - Also Try Minecraft
1418A - Buying Torches
131C - The World is a Theatre
1696A - NIT orz
1178D - Prime Graph
1711D - Rain
534A - Exam
1472A - Cards for Friends
315A - Sereja and Bottles
1697C - awoo's Favorite Problem
165A - Supercentral Point
1493A - Anti-knapsack
1493B - Planet Lapituletti
747B - Mammoth's Genome Decoding
1591C - Minimize Distance
1182B - Plus from Picture
1674B - Dictionary
1426C - Increase and Copy
520C - DNA Alignment
767A - Snacktower
1365A - Matrix Game
714B - Filya and Homework
31A - Worms Evolution